Pseudo-Boolean optimization
نویسندگان
چکیده
This survey examines the state of the art of a variety of problems related to pseudo-Boolean optimization, i.e. to the optimization of set functions represented by closed algebraic expressions. The main parts of the survey examine general pseudo-Boolean optimization, the specially important case of quadratic pseudo-Boolean optimization (to which every pseudo-Boolean optimization can be reduced), several other important special classes, and approximation algorithms. ∗This research was supported in part by the Office of Naval Research (Grant N00014-92J-1375) and by the National Science Foundation (Grant DMS 98-06389) †RUTCOR, Rutgers University, 640 Bartholomew Road, Piscataway, NJ 08854-8003, USA. Email: {boros,hammer}@rutcor.rutgers.edu
منابع مشابه
Weighted stability number of graphs and weighted satisfiability: The two facets of pseudo-Boolean optimization
We exhibit links between pseudo-Boolean optimization, graph theory and logic. We show the equivalence of maximizing a pseudo-Boolean function and finding a maximum weight stable set; symmetrically minimizing a pseudo-Boolean function is shown to be equivalent to solving a weighted satisfiability problem.
متن کاملLogic Programming with Pseudo-Boolean Constraints
Boolean constraints play an important role in various constraint logic programming languages. In this paper we consider pseudo-Boolean constraints, that is equations and inequalities between pseudo-Boolean functions. A pseudoBoolean function is an integer-valued function of Boolean variables and thus a generalization of a Boolean function. Pseudo-Boolean functions occur in many application area...
متن کاملPseudo-Boolean Optimization: Theory and Applications in Vision
Many problems in computer vision, such as stereo, segmentation and denoising can be formulated as pseudo-boolean optimization problems. Over the last decade, graphs cuts have become a standard tool for solving such problems. The last couple of years have seen a great advancement in the methods used to minimize pseudoboolean functions of higher order than quadratic. In this paper, we give an ove...
متن کاملPropagation Models and Fitting Them for the Boolean Random Sets
In order to study the relationship between random Boolean sets and some explanatory variables, this paper introduces a Propagation model. This model can be applied when corresponding Poisson process of the Boolean model is related to explanatory variables and the random grains are not affected by these variables. An approximation for the likelihood is used to find pseudo-maximum likelihood esti...
متن کاملNonlinear Pseudo-Boolean Optimization: Relaxation or Propagation?
Pseudo-Boolean problems lie on the border between satisfiability problems, constraint programming, and integer programming. In particular, nonlinear constraints in pseudo-Boolean optimization can be handled by methods arising in these different fields: One can either linearize them and work on a linear programming relaxation or one can treat them directly by propagation. In this paper, we inves...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 123 شماره
صفحات -
تاریخ انتشار 2002